---
title: "time needed to buy tickets"
created: 2025-11-28
tags:
  - 算法
---

# time needed to buy tickets

## 题目 [time needed to buy tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/description/)

![[image-14e61c37.png]]

## 思路分析

不需要真的把数据拷贝几份放在后面

直接无限次从0~n遍历 每次遍历过的i--

直到要求的地方变成0跳出循环

## 代码实现

```java
class Solution {

public:

    int timeRequiredToBuy(vector<int>& tickets, int k) {

        int step=0;

        while(true){

            for(int i=0;i<tickets.size();i++){

                if(tickets[i]==0)

                    continue;

                tickets[i]--;

                step++;

                if(tickets[k]==0)

                    return step;

            }

        }

    }

};
```

## 同类题型

## 视频讲解

---
⬅️ [[2-Learning/02-算法/03-刷题理模型/栈与队列相关模型/队列|队列]] 🏠 [[00-刷题理模型]] ➡️ [[公交换乘|公交换乘]]